0.00/0.06 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.07 % Command : run_E %s %d THM 0.05/0.25 % Computer : n023.cluster.edu 0.05/0.25 % Model : x86_64 x86_64 0.05/0.25 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.05/0.25 % Memory : 8042.1875MB 0.05/0.25 % OS : Linux 3.10.0-693.el7.x86_64 0.05/0.25 % CPULimit : 960 0.05/0.25 % WCLimit : 120 0.05/0.25 % DateTime : Tue Aug 9 06:16:57 EDT 2022 0.05/0.25 % CPUTime : 0.09/0.37 Running higher-order on 8 cores theorem proving 0.09/0.37 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.09/0.37 # Version: 3.0pre003-ho 0.09/0.38 # Preprocessing class: HSSSSMSSSLSNHSN. 0.09/0.38 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.09/0.38 # Starting ho_unfolding_3 with 600s (5) cores 0.09/0.38 # Starting lpo8_lambda_fix with 120s (1) cores 0.09/0.38 # Starting lpo8_s with 120s (1) cores 0.09/0.38 # Starting new_bool_11 with 120s (1) cores 0.09/0.38 # lpo8_lambda_fix with pid 12934 completed with status 0 0.09/0.38 # Result found by lpo8_lambda_fix 0.09/0.38 # Preprocessing class: HSSSSMSSSLSNHSN. 0.09/0.38 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.09/0.38 # Starting ho_unfolding_3 with 600s (5) cores 0.09/0.38 # Starting lpo8_lambda_fix with 120s (1) cores 0.09/0.38 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.09/0.38 # ...ProofStateSinE()=3/5 0.09/0.38 # Search class: HHUNF-FFSF00-SHSFMSBN 0.09/0.38 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.09/0.38 # Starting ho_unfolding_3 with 65s (1) cores 0.09/0.38 # ho_unfolding_3 with pid 12937 completed with status 0 0.09/0.38 # Result found by ho_unfolding_3 0.09/0.38 # Preprocessing class: HSSSSMSSSLSNHSN. 0.09/0.38 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.09/0.38 # Starting ho_unfolding_3 with 600s (5) cores 0.09/0.38 # Starting lpo8_lambda_fix with 120s (1) cores 0.09/0.38 # SinE strategy is GSinE(CountFormulas,,5.0,,4,20000,1.0) 0.09/0.38 # ...ProofStateSinE()=3/5 0.09/0.38 # Search class: HHUNF-FFSF00-SHSFMSBN 0.09/0.38 # Scheduled 6 strats onto 1 cores with 120 seconds (120 total) 0.09/0.38 # Starting ho_unfolding_3 with 65s (1) cores 0.09/0.38 # Preprocessing time : 0.001 s 0.09/0.38 # Presaturation interreduction done 0.09/0.38 0.09/0.38 # Proof found! 0.09/0.38 # SZS status Theorem 0.09/0.38 # SZS output start CNFRefutation 0.09/0.38 thf(decl_22, type, leibeq1: $i > $i > $o). 0.09/0.38 thf(decl_23, type, leibeq2: ($i > $i) > ($i > $i) > $o). 0.09/0.38 thf(decl_24, type, esk1_0: $i > $i). 0.09/0.38 thf(decl_25, type, esk2_0: $i > $i). 0.09/0.38 thf(decl_26, type, epred1_0: ($i > $i) > $o). 0.09/0.38 thf(decl_27, type, esk3_0: $i). 0.09/0.38 thf(leibeq2, axiom, ((leibeq2)=(^[X4:$i > $i, X5:$i > $i]:(![X6:($i > $i) > $o]:(((X6 @ X4)=>(X6 @ X5)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', leibeq2)). 0.09/0.38 thf(leibeq1, axiom, ((leibeq1)=(^[X1:$i, X2:$i]:(![X3:$i > $o]:(((X3 @ X1)=>(X3 @ X2)))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', leibeq1)). 0.09/0.38 thf(conj, conjecture, ![X7:$i > $i, X8:$i > $i]:((![X9:$i]:((leibeq1 @ (X7 @ X9) @ (X8 @ X9)))=>(leibeq2 @ X7 @ X8))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj)). 0.09/0.38 thf(c_0_3, plain, ((leibeq2)=(^[Z0:$i > $i, Z1:$i > $i]:(![X6:($i > $i) > $o]:(((X6 @ Z0)=>(X6 @ Z1)))))), inference(fof_simplification,[status(thm)],[leibeq2])). 0.09/0.38 thf(c_0_4, plain, ((leibeq1)=(^[Z0:$i, Z1:$i]:(![X3:$i > $o]:(((X3 @ Z0)=>(X3 @ Z1)))))), inference(fof_simplification,[status(thm)],[leibeq1])). 0.09/0.38 thf(c_0_5, negated_conjecture, ~(![X7:$i > $i, X8:$i > $i]:((![X9:$i, X13:$i > $o]:(((X13 @ (X7 @ X9))=>(X13 @ (X8 @ X9))))=>![X14:($i > $i) > $o]:(((X14 @ X7)=>(X14 @ X8)))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_3]), c_0_4])). 0.09/0.38 thf(c_0_6, negated_conjecture, ![X17:$i, X18:$i > $o]:(((~(X18 @ (esk1_0 @ X17))|(X18 @ (esk2_0 @ X17)))&((epred1_0 @ esk1_0)&~(epred1_0 @ esk2_0)))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])). 0.09/0.38 thf(c_0_7, negated_conjecture, ~((epred1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_6])). 0.09/0.38 thf(c_0_8, negated_conjecture, (epred1_0 @ esk1_0), inference(split_conjunct,[status(thm)],[c_0_6])). 0.09/0.38 thf(c_0_9, negated_conjecture, ![X3:$i > $o, X1:$i]:(((X3 @ (esk2_0 @ X1))|~((X3 @ (esk1_0 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_6])). 0.09/0.38 thf(c_0_10, plain, ((esk1_0)!=(esk2_0)), inference(ext_sup,[status(thm)],[c_0_7, c_0_8])). 0.09/0.38 thf(c_0_11, negated_conjecture, ![X1:$i]:(((esk1_0 @ X1)=(esk2_0 @ X1))), inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]), c_0_9])). 0.09/0.38 thf(c_0_12, plain, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_10]), c_0_11])]), ['proof']). 0.09/0.38 # SZS output end CNFRefutation 0.09/0.38 # Parsed axioms : 5 0.09/0.38 # Removed by relevancy pruning/SinE : 2 0.09/0.38 # Initial clauses : 3 0.09/0.38 # Removed in clause preprocessing : 0 0.09/0.38 # Initial clauses in saturation : 3 0.09/0.38 # Processed clauses : 8 0.09/0.38 # ...of these trivial : 0 0.09/0.38 # ...subsumed : 0 0.09/0.38 # ...remaining for further processing : 8 0.09/0.38 # Other redundant clauses eliminated : 0 0.09/0.38 # Clauses deleted for lack of memory : 0 0.09/0.38 # Backward-subsumed : 0 0.09/0.38 # Backward-rewritten : 1 0.09/0.38 # Generated clauses : 5 0.09/0.38 # ...of the previous two non-redundant : 4 0.09/0.38 # ...aggressively subsumed : 0 0.09/0.38 # Contextual simplify-reflections : 0 0.09/0.38 # Paramodulations : 0 0.09/0.38 # Factorizations : 0 0.09/0.38 # NegExts : 1 0.09/0.38 # Equation resolutions : 0 0.09/0.38 # Propositional unsat checks : 0 0.09/0.38 # Propositional check models : 0 0.09/0.38 # Propositional check unsatisfiable : 0 0.09/0.38 # Propositional clauses : 0 0.09/0.38 # Propositional clauses after purity: 0 0.09/0.38 # Propositional unsat core size : 0 0.09/0.38 # Propositional preprocessing time : 0.000 0.09/0.38 # Propositional encoding time : 0.000 0.09/0.38 # Propositional solver time : 0.000 0.09/0.38 # Success case prop preproc time : 0.000 0.09/0.38 # Success case prop encoding time : 0.000 0.09/0.38 # Success case prop solver time : 0.000 0.09/0.38 # Current number of processed clauses : 4 0.09/0.38 # Positive orientable unit clauses : 2 0.09/0.38 # Positive unorientable unit clauses: 0 0.09/0.38 # Negative unit clauses : 2 0.09/0.38 # Non-unit-clauses : 0 0.09/0.38 # Current number of unprocessed clauses: 2 0.09/0.38 # ...number of literals in the above : 2 0.09/0.38 # Current number of archived formulas : 0 0.09/0.38 # Current number of archived clauses : 4 0.09/0.38 # Clause-clause subsumption calls (NU) : 0 0.09/0.38 # Rec. Clause-clause subsumption calls : 0 0.09/0.38 # Non-unit clause-clause subsumptions : 0 0.09/0.38 # Unit Clause-clause subsumption calls : 0 0.09/0.38 # Rewrite failures with RHS unbound : 0 0.09/0.38 # BW rewrite match attempts : 2 0.09/0.38 # BW rewrite match successes : 1 0.09/0.38 # Condensation attempts : 8 0.09/0.38 # Condensation successes : 0 0.09/0.38 # Termbank termtop insertions : 378 0.09/0.38 0.09/0.38 # ------------------------------------------------- 0.09/0.38 # User time : 0.003 s 0.09/0.38 # System time : 0.001 s 0.09/0.38 # Total time : 0.005 s 0.09/0.38 # Maximum resident set size: 1792 pages 0.09/0.38 0.09/0.38 # ------------------------------------------------- 0.09/0.38 # User time : 0.005 s 0.09/0.38 # System time : 0.003 s 0.09/0.38 # Total time : 0.007 s 0.09/0.38 # Maximum resident set size: 1728 pages 0.09/0.38 EOF